package DataStructure.priority;

public class MaxPriorityQueueTest {
    public static void main(String[] args) {
        MaxPriorityQueue<String> queue = new MaxPriorityQueue<String>(11);


        queue.insert("S");
        queue.insert("O");
        queue.insert("R");
        queue.insert("T");
        queue.insert("E");
        queue.insert("X");
        queue.insert("A");
        queue.insert("M");
        queue.insert("P");
        queue.insert("L");
        queue.insert("E");

        while (!queue.isEmpty()){
            String max = queue.delMax();
            System.out.print(max+" ");
        }
    }
}
